A New Uncountably Categorical Group

نویسنده

  • ANDREAS BAUDISCH
چکیده

We construct an uncountably categorical group with a geometry that is not locally modular. It is not possible to interpret a field in this group. We show the group is CM-trivial.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Structure of Models of Uncountably Categorical Theories

The natural notion of categoricity, as it was discovered in the 1930's, is degenerate for first order languages, since only a finite structure can be described up to isomorphism by its first order theory. This has led to a new notion of categoricity. A theory is said to be categorical in a power if it has a model of this power which is unique up to isomorphism. Morley has proved, answering the ...

متن کامل

Another Stable Group Heisenberg-stipendiat Der Deutschen Forschungsgemeinschaft

In [3] an uncountably categorical group is constructed that has a non-locallymodular geometry and does not allow the interpretation of a eld. We consider a system of elementary axioms ful lled by some special subgroups of the group above. We show that is complete, stable, but not superstable. It is even not a R-group in the sense of [10].

متن کامل

Simple groups of finite

The Algebraicity Conjecture treats model-theoretic foundations of algebraic group theory. It states that any simple group of finite Morley rank is an algebraic group over an algebraically closed field. In the mid-1990s a view was consolidated that this project falls into four cases of different flavour: even type, mixed type, odd type, and degenerate type. This book contains a proof of the conj...

متن کامل

Simple groups of finite Morley

The Algebraicity Conjecture treats model-theoretic foundations of algebraic group theory. It states that any simple group of finite Morley rank is an algebraic group over an algebraically closed field. In the mid-1990s a view was consolidated that this project falls into four cases of different flavour: even type, mixed type, odd type, and degenerate type. This book contains a proof of the conj...

متن کامل

On the Computability-theoretic Complexity of Trivial, Strongly Minimal Models

We show the existence of a trivial, strongly minimal (and thus uncountably categorical) theory for which the prime model is computable and each of the other countable models computes 0′′. This result shows that the result of Goncharov/Harizanov/Laskowski/Lempp/McCoy (2003) is best possible for trivial strongly minimal theories in terms of computable model theory. We conclude with some remarks a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996